120 research outputs found

    Streaming Codes for Channels with Burst and Isolated Erasures

    Full text link
    We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be tuned to obtain a tradeoff between the capability to correct burst and isolated erasures. Our construction generalizes previously proposed low-delay codes which are effective only against burst erasures. We establish an information theoretic upper bound on the capability of any code to simultaneously correct burst and isolated erasures and show that our proposed constructions meet the upper bound in some special cases. We discuss the operational significance of column-distance and column-span metrics and establish that the rate 1/2 codes discovered by Martinian and Sundberg [IT Trans.\, 2004] through a computer search indeed attain the optimal column-distance and column-span tradeoff. Numerical simulations over a Gilbert-Elliott channel model and a Fritchman model show significant performance gains over previously proposed low-delay codes and random linear codes for certain range of channel parameters

    Loss-resilient Coding of Texture and Depth for Free-viewpoint Video Conferencing

    Full text link
    Free-viewpoint video conferencing allows a participant to observe the remote 3D scene from any freely chosen viewpoint. An intermediate virtual viewpoint image is commonly synthesized using two pairs of transmitted texture and depth maps from two neighboring captured viewpoints via depth-image-based rendering (DIBR). To maintain high quality of synthesized images, it is imperative to contain the adverse effects of network packet losses that may arise during texture and depth video transmission. Towards this end, we develop an integrated approach that exploits the representation redundancy inherent in the multiple streamed videos a voxel in the 3D scene visible to two captured views is sampled and coded twice in the two views. In particular, at the receiver we first develop an error concealment strategy that adaptively blends corresponding pixels in the two captured views during DIBR, so that pixels from the more reliable transmitted view are weighted more heavily. We then couple it with a sender-side optimization of reference picture selection (RPS) during real-time video coding, so that blocks containing samples of voxels that are visible in both views are more error-resiliently coded in one view only, given adaptive blending will erase errors in the other view. Further, synthesized view distortion sensitivities to texture versus depth errors are analyzed, so that relative importance of texture and depth code blocks can be computed for system-wide RPS optimization. Experimental results show that the proposed scheme can outperform the use of a traditional feedback channel by up to 0.82 dB on average at 8% packet loss rate, and by as much as 3 dB for particular frames

    Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays

    Full text link
    This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. The destination must perfectly recover every source message in the first sequence subject to a decoding delay TvT_\mathrm{v} and every source message in the second sequence subject to a shorter decoding delay TuTvT_\mathrm{u}\le T_\mathrm{v}. We assume that the channel loss model introduces a burst erasure of a fixed length BB on the discrete timeline. Under this channel loss assumption, the capacity region for the case where TvTu+BT_\mathrm{v}\le T_\mathrm{u}+B was previously solved. In this paper, we fully characterize the capacity region for the remaining case Tv>Tu+BT_\mathrm{v}> T_\mathrm{u}+B. The key step in the achievability proof is achieving the non-trivial corner point of the capacity region through using a multiplexed streaming code constructed by superimposing two single-stream codes. The main idea in the converse proof is obtaining a genie-aided bound when the channel is subject to a periodic erasure pattern where each period consists of a length-BB burst erasure followed by a length-TuT_\mathrm{u} noiseless duration.Comment: 20 pages, 1 figure, 1 table, presented in part at 2019 IEEE ISI

    Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures

    Full text link
    This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model introduces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss assumption, we fully characterize the maximum achievable rate by constructing streaming codes that achieve the optimal rate. In addition, our construction of optimal streaming codes implies the full characterization of the maximum achievable rate for convolutional codes with any given column distance, column span and decoding delay. Numerical results demonstrate that the optimal streaming codes outperform existing streaming codes of comparable complexity over some instances of the Gilbert-Elliott channel and the Fritchman channel.Comment: 36 pages, 3 figures, 2 table

    Healthcare facilities settings: an overview of environmentally-induced stress on health

    Get PDF
    The role of FM practitioners is to create an environment that sustains the primary objectives of the organisation. In managing healthcare facilities, the aim is to serve the healthcare users with efficient and quality medical environments in order to enhance the healing process. However, dysfunction that exists in environmental design is one of the issues often faced by the healthcare FM practitioners these days. Psychological stress is viewed as a consequence of design-behaviour dysfunction when the existing environmental design can no longer fit the need of users. With the possibility of certain environmental features to act as the sources of stressors, it is vital for FM practitioners to discover those features from the surrounding environment that appear to be harmful to the healthcare users. This paper provides an overview of the effect of the surrounding environment on stress. The association between environmentally induced-stress and the impacts of health is further discussed. Lastly, the application of evidence-based practice (EBP) is suggested in order to further the understanding for the association and intervention between environmental stressors and clinical outcomes
    corecore